#include<bits/stdc++.h>
using namespace std;
int n,a[100005],eat=1,duel=1;
int main(){
	freopen("duel.in","r",stdin);
	freopen("duel.out","w",stdout);
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i];
	sort(a+1,a+1+n);
	for(;duel<=n;duel++)
		if(a[duel]>a[eat])eat++;
	cout<<n-eat+1;
	return 0;
}
